An Algorithmic Approach to the Construction of Homomorphisms Induced by Maps in Homology
نویسندگان
چکیده
This paper is devoted to giving the theoretical background for an algorithm for computing homomorphisms induced by maps in homology. The principal idea is to insert the graph of a given continuous map f into a graph of a multi-valued representable map F . The multi-valued representable maps have well developed continuity properties and admit a finite coding that permits treating them by combinatorial methods. We provide the construction of the homomorphism F∗ induced by F such that F∗ = f∗. The presented construction does not require subsequent barycentric subdivisions and simplicial approximations of f . The main motivation for this paper comes from the project of computing the Conley Index for discrete dynamical systems.
منابع مشابه
On the pointfree counterpart of the local definition of classical continuous maps
The familiar classical result that a continuous map from a space $X$ to a space $Y$ can be defined by giving continuous maps $varphi_U: U to Y$ on each member $U$ of an open cover ${mathfrak C}$ of $X$ such that $varphi_Umid U cap V = varphi_V mid U cap V$ for all $U,V in {mathfrak C}$ was recently shown to have an exact analogue in pointfree topology, and the same was done for the familiar cla...
متن کاملZ-Cognitive Map: An Integrated Cognitive Maps and Z-Numbers Approach under Cognitive Information
Usually, in real-world engineering problems, there are different types of uncertainties about the studied variables, which can be due to the specific variables under investigation or interaction between them. Fuzzy cognitive maps, which addresses the cause-effect relation between variables, is one of the most common models for better understanding of the problems, especially when the quantitati...
متن کاملUmkehr Maps
In this note we study umkehr maps in generalized (co)homology theories arising from the Pontrjagin-Thom construction, from integrating along fibers, pushforward homomorphisms, and other similar constructions. We consider the basic properties of these constructions and develop axioms which any umkehr homomorphism must satisfy. We use a version of Brown representability to show that these axioms ...
متن کاملA Lagrangian Piunikhin-salamon-schwarz Morphism and Two Comparison Homomorphisms in Floer Homology
A. This article address two issues. First, we explore to what extend the techniques of Piunikhin, Salamon and Schwarz in [PSS96] can be carried over to Lagrangian Floer homology. In [PSS96] an isomorphism between Hamiltonian Floer homology and singular homology is established. In contrast, Lagrangian Floer homology is not isomorphic to the singular homology of the Lagrangian submanifold,...
متن کاملParallel Genetic Algorithm Using Algorithmic Skeleton
Algorithmic skeleton has received attention as an efficient method of parallel programming in recent years. Using the method, the programmer can implement parallel programs easily. In this study, a set of efficient algorithmic skeletons is introduced for use in implementing parallel genetic algorithm (PGA).A performance modelis derived for each skeleton that makes the comparison of skeletons po...
متن کامل